An Algorithm for Computing the Staircase Form of aSystem
نویسنده
چکیده
In this paper we propose a new recursive algorithm for computing the staircase form of a matrix pencil, and implicitly its Kronecker structure. The algorithm compares favorably to existing ones in terms of elegance, versatility, and complexity. In particular, the algorithm without any modiication yields the structural invari-ants associated with a generalized state{space system and its system pencil. Two related geometric aspects are also discussed: we show that an appropriate choice of a set of nested spaces related to the pencil leads directly to the staircase form; we extend the notion of deeating subspace to the singular pencil case.
منابع مشابه
Implementation of D3Q19 Lattice Boltzmann Method with a Curved Wall Boundary Condition for Simulation of Practical Flow Problems
In this paper, implementation of an extended form of a no-slip wall boundary condition is presented for the three-dimensional (3-D) lattice Boltzmann method (LBM) for solving the incompressible fluid flows with complex geometries. The boundary condition is based on the off-lattice scheme with a polynomial interpolation which is used to reconstruct the curved or irregular wall boundary on the ne...
متن کاملAN EFFICIENT OPTIMIZATION PROCEDURE BASED ON CUCKOO SEARCH ALGORITHM FOR PRACTICAL DESIGN OF STEEL STRUCTURES
Different kinds of meta-heuristic algorithms have been recently utilized to overcome the complex nature of optimum design of structures. In this paper, an integrated optimization procedure with the objective of minimizing the self-weight of real size structures is simply performed interfacing SAP2000 and MATLAB® softwares in the form of parallel computing. The meta-heuristic algorithm chosen he...
متن کاملAn Efficient Genetic Algorithm for Task Scheduling on Heterogeneous Computing Systems Based on TRIZ
An efficient assignment and scheduling of tasks is one of the key elements in effective utilization of heterogeneous multiprocessor systems. The task scheduling problem has been proven to be NP-hard is the reason why we used meta-heuristic methods for finding a suboptimal schedule. In this paper we proposed a new approach using TRIZ (specially 40 inventive principles). The basic idea of thi...
متن کاملTask Scheduling Algorithm Using Covariance Matrix Adaptation Evolution Strategy (CMA-ES) in Cloud Computing
The cloud computing is considered as a computational model which provides the uses requests with resources upon any demand and needs.The need for planning the scheduling of the user's jobs has emerged as an important challenge in the field of cloud computing. It is mainly due to several reasons, including ever-increasing advancements of information technology and an increase of applications and...
متن کاملAn Efficient Genetic Algorithm for Task Scheduling on Heterogeneous Computing Systems Based on TRIZ
An efficient assignment and scheduling of tasks is one of the key elements in effective utilization of heterogeneous multiprocessor systems. The task scheduling problem has been proven to be NP-hard is the reason why we used meta-heuristic methods for finding a suboptimal schedule. In this paper we proposed a new approach using TRIZ (specially 40 inventive principles). The basic idea of thi...
متن کامل